منابع مشابه
Mathematical programming based debugging
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain bounds. Abstract interpretation is used in the static analysis of code to establish the inclusion-wise smallest set of values (numerical invariant) that the program variables can attain during program execution. Such sets can be used to de...
متن کاملRational Logic Programming Debugging
Information about Prolog data term's dependencies on derivation goals can be used for improved debugging, whether in the wrong solution or the missing solution type of faulty program behaviour. A debugger for full Prolog (itself written in Prolog) has been developed which automates the reasoning ability required to pinpoint errors, resorting to the user only to ask about the intended program se...
متن کاملDebugging Event-Driven Programming
The importance of the event-driven programming (EDP) paradigm is on the rise. While EDP has been been common in client-side applications since around 2000 (e.g. GUI development, JavaScript-driven web pages), it has only recently entered the mainstream in the settings of mobile computing (Android, 2008 [15]) and server-side programming (Node.js, 2009 [18]). The EDP paradigm is also a natural way...
متن کاملA Framework for Assertion-Based Debugging in Constraint Logic Programming
A b s t r a c t . We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of programs. We define assertion schemas which allow writing (partial) specifications for constraint logic programs using quite general properties, including user-defined programs. The framework is aimed at detecti...
متن کاملDeclarative Debugging in Constraint Logic Programming
This paper is motivated by the declarative insuuciency diagnosis of constraint logic programs, but focuses only on theoretical viewpoints. Many techniques have been developed for logic programming but cannot be merely adapted to constraint logic programming. Constraint logic program semantics is redeened in terms of proof trees using a cover relation. Proof trees give an intrinsic deenition to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2010
ISSN: 1571-0653
DOI: 10.1016/j.endm.2010.05.166